Strange images of profinite groups
نویسنده
چکیده
We investigate whether a finitely generated profinite group G could have a finitely generated infinite image. A result of Dan Segal shows that this is impossible if G is prosoluble. We prove that such an image does not exist if G is semisimple or nonuniversal.
منابع مشابه
Cohomology of Profinite Groups
The aim of this thesis is to study profinite groups of type FPn. These are groups G which admit a projective resolution P of Ẑ as a ẐJGK-module such that P0, . . . , Pn are finitely generated, so this property can be studied using the tools of profinite group cohomology. In studying profinite groups it is often useful to consider their cohomology groups with profinite coefficients, but pre-exis...
متن کاملFrobenius Subgroups of Free Profinite Products
We solve an open problem of Herfort and Ribes: Profinite Frobenius groups of certain type do occur as closed subgroups of free profinite products of two profinite groups. This also solves a question of Pop about prosolvable subgroups of free profinite products.
متن کاملContinuous Cohomology of Permutation Groups on Profinite Modules
We investigate the continuous cohomology of infinite permutation groups on modules whose topology is profinite. To obtain acyclics we expand the class of modules to include those which are directed unions of their profinite submodules. As an application we give a criterion which implies finiteness of the continuous cohomology groups on finitely generated profinite modules for some familiar perm...
متن کاملProfinite Groups Associated with Weakly Primitive Substitutions
A uniformly recurrent pseudoword is an element of a free profinite semigroup in which every finite factor appears in every sufficiently long finite factor. An alternative characterization is as a pseudoword which is a factor of all its infinite factors, that is one which lies in a J -class with only finite words strictly J -above it. Such a J -class is regular and therefore it has an associated...
متن کاملThe Geometry of Profinite Graphs with Applications to Free Groups and Finite Monoids
We initiate the study of the class of profinite graphs Γ defined by the following geometric property: for any two vertices v and w of Γ, there is a (unique) smallest connected profinite subgraph of Γ containing them; such graphs are called tree-like. Profinite trees in the sense of Gildenhuys and Ribes are tree-like, but the converse is not true. A profinite group is then said to be dendral if ...
متن کامل